Sipser, M.: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

[ACM Press the twenty-fourth annual ACM symposium - Victoria, British Columbia, Canada (1992.05.04-1992.05.06)] Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 - The history and status of the P versus NP question

Sipser, Michael

Year:

1992

Language:

english

File:

PDF, 1.60 MB

english, 1992

2

[ACM Press the tenth annual ACM symposium - San Diego, California, United States (1978.05.01-1978.05.03)] Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 - Nondeterminism and the size of two way finite automata

Sakoda, William J., Sipser, Michael

Year:

1978

Language:

english

File:

PDF, 900 KB

english, 1978

3

Lower bounds on the size of sweeping automata

Journal:

Journal of Computer and System Sciences

Year:

1980

Language:

english

File:

PDF, 478 KB

english, 1980

4

Several results in program size complexity

Howard P. Katseff, Michael Sipser

Journal:

Theoretical Computer Science

Year:

1981

Language:

english

File:

PDF, 2.14 MB

english, 1981

5

Parity, circuits, and the polynomial-time hierarchy

Merrick Furst, James B. Saxe, Michael Sipser

Journal:

Theory of Computing Systems

Year:

1984

Language:

english

File:

PDF, 880 KB

english, 1984

6

[ACM Press the eighteenth annual ACM symposium - Berkeley, California, United States (1986.05.28-1986.05.30)] Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 - Private coins versus public coins in interactive proof systems

Goldwasser, S, Sipser, M

Year:

1986

Language:

english

File:

PDF, 736 KB

english, 1986

7

Optimal Constructions of Hybrid Algorithms

Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Yin

Journal:

Journal of Algorithms

Year:

1998

Language:

english

File:

PDF, 288 KB

english, 1998

8

Communication complexity

Christos H. Papadimitriou, Michael Sipser

Journal:

Journal of Computer and System Sciences

Year:

1984

Language:

english

File:

PDF, 613 KB

english, 1984

9

Expanders, randomness, or time versus space

Journal:

Journal of Computer and System Sciences

Year:

1988

Language:

english

File:

PDF, 285 KB

english, 1988

10

Graph bisection algorithms with good average case behavior

T. N. Bui, S. Chaudhuri, F. T. Leighton, M. Sipser

Journal:

Year:

1987

Language:

english

File:

PDF, 1.26 MB

english, 1987

11

Notes on notation

Kenneth Sipser and Edward Dolan

Journal:

Mathematics Teacher

Year:

1978

Language:

english

File:

PDF, 269 KB

english, 1978

12

Monotone Separation of Logarithmic Space from Logarithmic Depth

M. Grigni, M. Sipser

Journal:

Journal of Computer and System Sciences

Year:

1995

File:

PDF, 379 KB

1995

13

EDITOR'S FOREWORD

Journal:

Journal of Computer and System Sciences

Year:

1997

File:

PDF, 136 KB

1997

14

Halting space-bounded computations

Journal:

Theoretical Computer Science

Year:

1980

Language:

english

File:

PDF, 378 KB

english, 1980

15

On the power of multi-prover interactive protocols

Lance Fortnow, John Rompel, Michael Sipser

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 920 KB

english, 1994

16

Frequency of dizygotic twinning

SIPSER, MICHAEL

Journal:

Year:

1986

File:

PDF, 129 KB

1986

17

Are there interactive protocols for co-NP languages?

Lance Fortnow, Michael Sipser

Journal:

Information Processing Letters

Year:

1988

Language:

english

File:

PDF, 319 KB

english, 1988

18

Compression and Ranking

Goldberg, Andrew V., Sipser, Michael

Journal:

SIAM Journal on Computing

Year:

1991

Language:

english

File:

PDF, 1.49 MB

english, 1991

19

[ACM Press the fifteenth annual ACM symposium - Not Known (1983..-..)] Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 - Borel sets and circuit complexity

Sipser, Michael

Year:

1983

Language:

english

File:

PDF, 522 KB

english, 1983

20

[ACM Press the fifteenth annual ACM symposium - Not Known (1983..-..)] Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 - A complexity theoretic approach to randomness

Sipser, Michael

Year:

1983

Language:

english

File:

PDF, 333 KB

english, 1983

21

GO Is Polynomial-Space Hard

Lichtenstein, David, Sipser, Michael

Journal:

Journal of the ACM

Year:

1980

Language:

english

File:

PDF, 401 KB

english, 1980

22

On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals

Barbara Simons and Michael Sipser

Journal:

Operations Research

Year:

1984

Language:

english

File:

PDF, 264 KB

english, 1984

23

Expander codes

Sipser, M., Spielman, D.A.

Journal:

IEEE Transactions on Information Theory

Year:

1996

Language:

english

File:

PDF, 1.52 MB

english, 1996

24

[IEEE [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science - White Plains, NY, USA (1988.10.24-1988.10.26)] [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science - Dynamic networks are as fast as static networks

Awerbuch, B., Sipser, M.

Year:

1988

Language:

english

File:

PDF, 1.04 MB

english, 1988

25

[IEEE 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - Ann Arbor, MI, USA (1978.10.16-1978.10.18)] 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - GO is pspace hard

Lichtenstein, David, Sipser, Michael

Year:

1978

Language:

english

File:

PDF, 511 KB

english, 1978

26

[IEEE 22nd Annual Symposium on Foundations of Computer Science - Nashville, TN, USA (1981.10.28-1981.10.30)] 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) - Maximum matching in sparse random graphs

Karp, R. M., Sipser, M.

Year:

1981

Language:

english

File:

PDF, 1.95 MB

english, 1981

27

[IEEE [1988] Proceedings. Structure in Complexity Theory Third Annual Conference - Washington, DC, USA (1988.06.14-1988.06.17)] [1988] Proceedings. Structure in Complexity Theory Third Annual Conference - On the power of multi-power interactive protocols

Fortnow, L., Rompel, J., Sipser, M.

Year:

1988

Language:

english

File:

PDF, 490 KB

english, 1988

28

[IEEE 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - Ann Arbor, MI, USA (1978.10.16-1978.10.18)] 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - Halting space-bounded computations

Sipser, Michael

Year:

1978

Language:

english

File:

PDF, 211 KB

english, 1978

29

[IEEE Comput. Soc. Press 35th Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA (20-22 Nov. 1994)] Proceedings 35th Annual Symposium on Foundations of Computer Science - Expander codes

Sipser, M., Spielman, D.A.

Year:

1994

Language:

english

File:

PDF, 905 KB

english, 1994

30

[IEEE 28th Annual Symposium on Foundations of Computer Science - Los Angeles, CA, USA (1987.10.12-1987.10.14)] 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) - Interactive proof systems: Provers that never fail and random selection

Goldreich, Oded, Mansour, Yishay, Sipser, Michael

Year:

1987

Language:

english

File:

PDF, 1.76 MB

english, 1987

31

quantum queries

Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, Sipser, Michael

Journal:

Physical Review A

Year:

1999

Language:

english

File:

PDF, 40 KB

english, 1999

32

[IEEE 22nd Annual Symposium on Foundations of Computer Science - Nashville, TN, USA (1981.10.28-1981.10.30)] 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) - Parity, circuits, and the polynomial-time hierarchy

Furst, Merrick, Saxe, James B., Sipser, Michael

Year:

1981

Language:

english

File:

PDF, 1.26 MB

english, 1981

33

[IEEE 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) - Providence, RI, USA (1977.10.31-1977.11.2)] 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) - Several results in program size complexity

Katseff, Howard P., Sipser, Michael

Year:

1977

Language:

english

File:

PDF, 1.02 MB

english, 1977

34

Limit on the Speed of Quantum Computation in Determining Parity

Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, Sipser, Michael

Journal:

Physical Review Letters

Year:

1998

Language:

english

File:

PDF, 91 KB

english, 1998

35

[IEEE 25th Annual Symposium onFoundations of Computer Science, 1984. - Singer Island, FL (1984.10.24-1984.10.26)] 25th Annual Symposium onFoundations of Computer Science, 1984. - Graph Bisection Algorithins With Good Average Case Behavior

Thang Bui,, Chaudhuri, S., Leighton, T., Sipser, M.

Year:

1984

Language:

english

File:

PDF, 1.10 MB

english, 1984

36

[IEEE Comput Soc. Press Sixth Annual Structure in Complexity Theory Conference - Chicago, IL, USA (30 June-3 July 1991)] [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference - Monotone separation of logspace from NC/sup 1/

Grigni, M., Sipser, M.

Year:

1991

Language:

english

File:

PDF, 380 KB

english, 1991

37

[ACM Press the twenty-ninth annual ACM symposium - El Paso, Texas, United States (1997.05.04-1997.05.06)] Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 - Retraction of probabilistic computation and linear time

Fortnow, Lance, Sipser, Michael

Year:

1997

Language:

english

File:

PDF, 281 KB

english, 1997

38

[ACM Press the seventh annual conference - New Brunswick, New Jersey, United States (1994.07.12-1994.07.15)] Proceedings of the seventh annual conference on Computational learning theory - COLT '94 - Inference and minimization of hidden Markov chains

Gillman, David, Sipser, Michael

Year:

1994

Language:

english

File:

PDF, 1.11 MB

english, 1994

39

[ACM Press the eleventh annual ACM symposium - Atlanta, Georgia, United States (1979.04.30-1979.05.02)] Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 - Lower bounds on the size of sweeping automata

Sipser, Michael

Year:

1979

Language:

english

File:

PDF, 288 KB

english, 1979

40

[ACM Press the seventeenth annual ACM symposium - Providence, Rhode Island, United States (1985.05.06-1985.05.08)] Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 - Compression and ranking

Goldberg, A, Sipser, M

Year:

1985

Language:

english

File:

PDF, 823 KB

english, 1985

41

[ACM Press the fourteenth annual ACM symposium - San Francisco, California, United States (1982.05.05-1982.05.07)] Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 - Communication complexity

Papadimitriou, Christos H., Sipser, Michael

Year:

1982

Language:

english

File:

PDF, 409 KB

english, 1982

42

[IEEE 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) - Toronto, ON, Canada (1986.10.27-1986.10.29)] 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) - Foreword

Aggarwal, Alok, Hopcroft, John, Kannan, Ravi, Leiserson, Charles E., Lynch, Nancy, Miller, Gary, Seiferas, Joel, Sipser, Michael, Sudborough, Ivan Hal, Vardi, Moshe, Vazirani, Umesh, Yannakakis, Mihal

Year:

1986

Language:

english

File:

PDF, 42 KB

english, 1986

43

On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals

Simons, Barbara, Sipser, Michael

Journal:

Operations Research

Year:

1984

Language:

english

File:

PDF, 531 KB

english, 1984

44

The future of computational complexity theory: part I

Papadimitriou, Christos H., Goldreich, Oded, Wigderson, Avi, Razborov, Alexander A., Sipser, Michael

Journal:

ACM SIGACT News

Year:

1996

Language:

english

File:

PDF, 505 KB

english, 1996